Game-theoretic Brownian motion
نویسنده
چکیده
This paper suggests a perfect-information game, along the lines of Lévy’s characterization of Brownian motion, that formalizes the process of Brownian motion in game-theoretic probability. This is perhaps the simplest situation where probability emerges in a non-stochastic environment.
منابع مشابه
The Borell-ehrhard Game
A precise description of the convexity of Gaussian measures is provided by sharp Brunn-Minkowski type inequalities due to Ehrhard and Borell. We show that these are manifestations of a game-theoretic mechanism: a minimax variational principle for Brownian motion. As an application, we obtain a Gaussian improvement of Barthe’s reverse Brascamp-Lieb inequality.
متن کاملA Game - Theoretic Explanation of the √ dt Effect
The returns from a traded security typically have the order of magnitude √ dt. This can be explained by the absence of riskless opportunities for making money: any different order of magnitude would permit such opportunities. The explanation has been made rigorous in the standard measure-theoretic framework for continuous-time probability, but this requires the assumption that the security’s pr...
متن کاملContinuous-time trading and the emergence of probability
This paper establishes a non-stochastic analogue of the celebrated result by Dubins and Schwarz about reduction of continuous martingales to Brownian motion via time change. We consider an idealized financial security with continuous price process, without making any stochastic assumptions. It is shown that almost all sample paths of the price process possess quadratic variation, where “almost ...
متن کاملNGTSOM: A Novel Data Clustering Algorithm Based on Game Theoretic and Self- Organizing Map
Identifying clusters is an important aspect of data analysis. This paper proposes a noveldata clustering algorithm to increase the clustering accuracy. A novel game theoretic self-organizingmap (NGTSOM ) and neural gas (NG) are used in combination with Competitive Hebbian Learning(CHL) to improve the quality of the map and provide a better vector quantization (VQ) for clusteringdata. Different ...
متن کاملTug of war with noise: a game theoretic view of the p-Laplacian
Fix a bounded domain Ω ⊂ Rd, a continuous function F : ∂Ω → R, and constants ǫ > 0 and 1 < p, q < ∞ with p−1 + q−1 = 1. For each x ∈ Ω, let uǫ(x) be the value for player I of the following two-player, zero-sum game. The initial game position is x. At each stage, a fair coin is tossed and the player who wins the toss chooses a vector v ∈ B(0, ǫ) to add to the game position, after which a random ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008